A generalized shortest path tour problem with time windows

Abstract This paper studies a generalization of the shortest path tour problem with time windows ( GSPTPTW ). The aim is to find single-origin single-destination path, which has pass through an ordered sequence not necessarily disjoint node-subsets. Each node window for each node-subset it belongs. We investigate theoretical properties and propose dynamic programming approach solve it. Numerical results collected on large set new benchmark instances highlight effectiveness proposed solution approach.